Approximations of a Ginzburg-Landau model for superconducting hollow spheres based on spherical centroidal Voronoi tessellations

In this paper the numerical approximations of the Ginzburg- Landau model for a superconducting hollow spheres are constructed using a gauge invariant discretization on spherical centroidal Voronoi tessellations. A reduced model equation is used on the surface of the sphere which is valid in the thin spherical shell limit. We present the numerical algorithms and their theoretical convergence as well as interesting numerical results on the vortex configurations. Properties of the spherical centroidal Voronoi tessellations are also utilized to provide a high resolution scheme for computing the supercurrent and the induced magnetic field.

     

关于软玻密子的结构

本文修改了Landshoff-Nachtmann的软玻密子(Pomeron P)场论模型.从强子组分夸克具有结构的观点出发,根据高能强作用软过程中的最大非微扰强作用反应假定,提出了有关软P新的结构图像.对撞强子中的一对组分夸克被分解为裸夸克和一系列非微扰胶子(和夸克对).与此相应,软P的结构是由胶子形成的一系列切割梯形图之和所代表.在系统能量s很大而动量转移|t|很小的多重雷吉(Regge)运动学区间,并在保留lns的领头阶近似下,计算了这组切割梯形图之和所对应的散射振幅和总截面.它们的表达式出现了对s的Regge型幂次因子,得出了软P轨迹的简洁表达式.简单说明了按本文提出的方案可以讨论那些相关的强作用过程.     

Algebras Generated by Linearly Dependent Elements with Prescribed Spectra

We consider associative algebras presented by a finite set of generators and relations of special form: each generator is annihilated by some polynomial, and the sum of generators is zero. The growth of this algebra in dependence on the degrees of the polynomials annihilating the generators is studied. The tuples of degrees for which the algebras are finite-dimensional, have polynomial growth, or have exponential growth are indicated. To the tuple of degrees, we assign a graph, and the above-mentioned cases correspond to Dynkin diagrams, extended Dynkin diagrams, and the other graphs, respectively. For extended Dynkin diagrams, we indicate the hyperplane in the space of parameters (roots of the polynomials) on which the corresponding algebras satisfy polynomial identities.     

Two-loop Gell-Mann-Low function of the <Emphasis Type="Italic">N</Emphasis>=1 supersymmetric Yang-Mills theory regularized by higher covariant derivatives

We calculate the two-loop Gell-Mann-Low function for the N=1 supersymmetric Yang-Mills theory regularized by higher covariant derivatives. We show that the integrals determining this function reduce to total derivatives and can be easily calculated analytically. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 155, No. 3, pp. 398–414, June, 2008.     

On the Ising Model with Strongly Anisotropic External Field

In this paper we analyze the equilibrium phase diagram of the two-dimensional ferromagnetic n.n. Ising model when the external field takes alternating signs on different rows. We show that some of the zero-temperature coexistence lines disappear at every positive sufficiently small temperature, whereas one (and only one) of them persists for sufficiently low temperature.     

On the performance of the ICP algorithm

We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay as a successful heuristic for matching of point sets in d-space under translation, but so far it seems not to have been rigorously analyzed. We consider two standard measures of resemblance that the algorithm attempts to optimize: The RMS (root mean squared distance) and the (one-sided) Hausdorff distance. We show that in both cases the number of iterations performed by the algorithm is polynomial in the number of input points. In particular, this bound is quadratic in the one-dimensional problem, under the RMS measure, for which we present a lower bound construction of Ω(nlogn) iterations, where n is the overall size of the input. Under the Hausdorff measure, this bound is only O(n) for input point sets whose spread is polynomial in n, and this is tight in the worst case.We also present several structural geometric properties of the algorithm under both measures. For the RMS measure, we show that at each iteration of the algorithm the cost function monotonically and strictly decreases along the vector Δt of the relative translation. As a result, we conclude that the polygonal path π, obtained by concatenating all the relative translations that are computed during the execution of the algorithm, does not intersect itself. In particular, in the one-dimensional problem all the relative translations of the ICP algorithm are in the same (left or right) direction. For the Hausdorff measure, some of these properties continue to hold (such as monotonicity in one dimension), whereas others do not.     

Nonlinear modes in rotating double well potential with parity–time symmetry

We investigate the nonlinear modes in a rotating double well potential with 79T symmetry. Focus on the existence and stability of the nonlinear PT modes in this system, we found that five types of PT modes can stably exist by given certain parameter settings. The multistable area between these modes are studied numerically and the bistable and tristable areas are delimited. With different input trial wavefunctions, five types of solitary wave modes are identified. We found that the rotating of the potential can significantly affect the power flow of the fundamental harmonic mode, whose effect is absent for the other modes.     

Chaos forgets and remembers: Measuring information creation,destruction, and storage

The hallmark of deterministic chaos is that it creates information—the rate being given by the Kolmogorov–Sinai metric entropy. Since its introduction half a century ago, the metric entropy has been used as a unitary quantity to measure a system's intrinsic unpredictability. Here, we show that it naturally decomposes into two structurally meaningful components: A portion of the created information—the ephemeral information—is forgotten and a portion—the bound information—is remembered. The bound information is a new kind of intrinsic computation that differs fundamentally from information creation: it measures the rate of active information storage. We show that it can be directly and accurately calculated via symbolic dynamics, revealing a hitherto unknown richness in how dynamical systems compute.     

基于Voronoi图和动态自适应蚁群算法的UAV航迹规划

以UAV航迹规划为应用背景,提出了一种基于Voronoi图和动态自适应蚁群算法的航迹规划方法;为了提高航迹规划问题最优解的质量及全局求解能力,克服传统蚁群算法收敛速度慢、容易陷入局部最优等缺点,提出了一种动态自适应蚁群算法;采用动态自适应航迹点选择策略并将信息素更新规则和挥发系数进行动态自适应调整变化来对蚁群算法进行了改进,提高了算法的求解效率;根据战场已知威胁源生成Voronoi加权图,并与所提的动态自适应蚁群算法相结合求解规划空间中的最优航迹;考虑到UAV的物理约束限制,对生成的可行航迹进行平滑优化;仿真结果表明,该方法能够为UAV规划出一条满足要求的可飞航迹,验证了所提方法在解决航迹规划问题时是可行、有效的;     

非相对论弱相互作用玻色气体的有效场理论处理

采用有效场理论研究了非相对论弱相互作用玻色-爱因斯坦凝聚量子气体的一般性质.在分析了系统的不可重整化性质后,从有效拉氏量出发,计算了最低阶环路修正下拉氏量参量的运动耦合常数(running coupling constant)的形式,并且得到了相应的微分方程.研究结果表明,不同于相对论玻色气体的有效理论,对非相对论弱相互作用的玻色气体,可以移除该有效理论中的内禀能量尺度,即可令该有效理论的内禀能量尺度取无穷大值.所得的分析结果将有助于对玻色-爱因斯坦凝聚的临界性质和行为的深入研究.